منابع مشابه
s-Vertex Pancyclic Index
A graph G is vertex pancyclic if for each vertex v ∈ V (G), and for each integer k with 3 ≤ k ≤ |V (G)|, G has a k-cycle Ck such that v ∈ V (Ck). Let s ≥ 0 be an integer. If the removal of at most s vertices in G results in a vertex pancyclic graph, we say G is an s-vertex pancyclic graph. Let G be a simple connected graph that is not a path, cycle or K1,3. Let l(G) = max{m : G has a divalent p...
متن کاملCharacterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs
A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mutually opposite arcs with the same end vertices is called a complete multipartite digraph. Such a digraph D is called ordinary if for any pair X, Y of its partite sets the set of arcs with end vertices in X ∪ Y coincides with X × Y = {x, y) : x ∈ X, y ∈ Y } or Y ×X or X×Y ∪Y ×X. We characterize a...
متن کاملVertex Pancyclic Graphs
Let G be a graph of order n. A graph G is called pancyclic if it contains a cycle of length k for every 36 k6 n, and it is called vertex pancyclic if every vertex is contained in a cycle of length k for every 36 k6 n. In this paper, we shall present di0erent su1cient conditions for graphs to be vertex pancyclic. ? 2002 Elsevier Science B.V. All rights reserved.
متن کاملA note on vertex pancyclic oriented graphs
Let D be an oriented graph of order n 9, minimum degree n ? 2, such for choice of distinct vertices x and y, either xy 2 E(D) or d + (x)+d ? (y) n?3. Song (J. Graph Theory 18 (1994), 461{468) proved that D is pancyclic. In this note, we give a short proof, based on Song's result, that D is in fact vertex pancyclic. This also generalizes a result of Jackson (J. Graph Theory 5 (1981), 147{157) fo...
متن کاملPancyclic out-arcs of a vertex in a hypertournament
A k-hypertournament H on n vertices, where 2 ≤ k ≤ n, is a pair H = (V,AH), where V is the vertex set of H and AH is a set of k-tuples of vertices, called arcs, such that for all subsets S ⊆ V of order k, AH contains exactly one permutation of S as an arc. Inspired by the successful extension of classical results for tournaments (i.e. 2-hypertournaments) to hypertournaments, by Gutin and Yeo [J...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1976
ISSN: 0095-8956
DOI: 10.1016/0095-8956(76)90061-7